Performance Analysis of Controlled Scalability in Unstructured Peer-to-Peer Networks
نویسندگان
چکیده
In unstructured peer-to-peer networks, the analysis of scalability is a challenging task due to the unpredictable nature of churn rate. Specifically, in the P2P file sharing applications, peers join and leave the overlay network in a dynamic fashion increase the complexity of the network and leads to a huge wastage of bandwidth during the search for a particular file. In this paper, we proposed a controlled scalability model in unstructured P2P networks for achieving efficient bandwidth utilization and high scalability. Performance measures such as peer availability and scalability are analyzed and compared with the BitTorrent system show that the proposed model overcomes the problems of bandwidth wastage and initial time flash crowd while maintaining the scalability of the network. Mathematical modeling and simulation results illustrates that the controlled scalability performs well in utilizing bandwidth during the event of polluted or infected files sharing than the uncontrolled scalability in the existing unstructured P2P networks.
منابع مشابه
Randomized Algorithms in Unstructured Peer-to-Peer Networks
We present a survey of random algorithms in unstructured peer-to-peer networks by focusing on search, replication, and construction algorithms. A heavy emphasis is placed on the scalability and performance of the various schemes studied. The importance of random algorithms emerges clearly from this study. Shortcomings of the current state of research are identified and directions for future wor...
متن کاملScalable Index and Data Management for Unstructured Peer-To-Peer Networks
In order to improve the scalability and reduce the traffic of Gnutella-like unstructured peer-to-peer networks, index caching and controlled flooding mechanisms had been an important research topic in recent years. In this chapter the authors will describe and present the current state of the art about index management schemes, interest groups and data clustering for unstructured peer-to-peer n...
متن کاملCriticality-based Analysis and Design of Unstructured Peer-to-Peer Networks as "Complex Systems"
Due to enormous complexity of the unstructured peer-to-peer networks as large-scale, self-configure, and dynamic systems, the models used to characterize these systems are either inaccurate, because of oversimplification, or analytically inapplicable, due to their high complexity. By recognizing unstructured peer-to-peer networks as “complex systems”, we employ statistical models used before to...
متن کاملA Scalable Search Algorithm for Unstructured Peer-to-Peer Networks
Scalability in a peer-to-peer network is a challenging problem. Unstructured peer-to-peer networks inherently lack scalability, and structured networks are inefficient for a high churn rate. In this paper, we present a scalable search algorithm for a decentralized unstructured peer-to-peer network using a method to dynamically determine the number of nodes to forward a query to at once. The dec...
متن کاملData Search and Replication in Unstructured Peer-to-Peer Networks
The Peer-to-Peer (P2P) architectures that are most prevalent in today’s internet are decentralized and unstructured. The advantage for this type of networks is that they require no centralized directories and no process control over network topology or data placement. However, the flooding-based query strategy used in these networks does not scale. In this paper, we first introduce three basic ...
متن کامل